Product Form Queueing Networks
نویسنده
چکیده
Queueing network models have been extensively applied to represent and analyze resource sharing systems such as communication and computer systems and they have proved to be a powerful and versatile tool for system performance evaluation and prediction. Product form queueing networks have a simple closed form expression of the stationary state distribution that allow to define efficient algorithms to evaluate average performance measures. We introduce product form queueing networks and some interesting properties including the arrival theorem, exact aggregation and insensitivity. Various special models of product form queueing networks allow to represent particular system features such as state-dependent routing, negative customers, batch arrivals and departures and finite capacity queues.
منابع مشابه
Product Form Queueing Petri Nets: A Combination of Product Form Queueing Networks and Product Form Stochastic Petri Nets
The product form results recently published for Stochastic Petri Nets are combined with the well known product form results for Queueing Networks in the model formalism of Queueing Petri Nets yielding the class of product form Queueing Petri Nets. This model class includes Stochastic Petri Nets with product form solution and BCMP Queueing Networks as special cases. We introduce an arrival theor...
متن کاملOn the Non-existence of Product-form Solutions for Queueing Networks with Retrials
During the last two decades, several authors have identified several classes of queueing networks (with batch movements, negative customers, signals etc.) that have product-form stationary distributions. On the contrary, there is a very slow progress in the analytic investigation of queueing networks with retrials and there does not exist a single example of such a network with a product-form s...
متن کاملSERIE RESEARCH mEITlORBnun "STOP = RECIRCULATE" FOR EXPONENTIAL PRODUCT FORM QUEUEING NETWORKS WITH DEPARTURE BLOCKING
The blocking protocols of "stopping service" and of "recirculating" jobs through an entire system are shown to be equivalent for Jacksonian queueing networks with blocked departures. Queueing networks * product-form * stopping and recirculating blocking protocol •* partial balance.
متن کاملOn the Use of Structural Petri Net Analysis for Studying Product Form Equilibrium Distributions of Queueing Networks with Blocking
In this paper we investigate some relations between the Petri net formalism and the queueing networks with blocking. This type of queueing network models are used to represent systems with finite capacity resource constraints, such as production, communication and computer systems. Various blocking mechanisms have been defined in the literature to represent the different behaviours of real syst...
متن کاملThe Octave Queueing Package
Queueing Networks are a widely used performance modeling tool that has been successfully applied to evaluate many kind of systems. In this paper we describe the queueing package, a collection of numerical solution algorithms for Queueing Networks and Markov chains written in GNU Octave (an interpreted language for numerical computations). The queueing package allows users to compute steady-stat...
متن کامل